Prolog in Ten Figures

نویسنده

  • Alain Colmerauer
چکیده

Prolog is presented in a rigourous way, through 10 easi ly understandable f i gu res . I t s theoret ica l model is completly rewrought. After introducing i n f i n i t e trees and i nequa l i t i es , t h i s paper puts fo r th the minimal set of concepts necessary to give Prolog an autonomous existence, independent of lengthy considerations about f i r s t order logic and inference ru les . Mystery is sacr i f i ced in favor of c l a r i t y .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constraint Based Automatic Construction and Manipulation of Geometric Figures

An important component of an Inte l l igent Tu to r ing System ( ITS) for teaching geometry is its capacity to transform a f igure in to as many different figures as possible, yet all of which respect the same underlying logical specification. Given a logical specification for a figure, ( i) a figure can be constructed automatically from the objects and properties in the spepification; and ( i ...

متن کامل

TR-2003014: A High-Performance Abstract Machine for Prolog and Its Extensions

This paper describes the design and the implementation of the TOAM (Tree-Oriented Abstract Machine) for Prolog and its extensions. The TOAM, as a Prolog machine, is based on the famous WAM model but differs from it in argument passing, stack management, and clause indexing. The original TOAM for Prolog was designed over ten years ago and the architecture was published in ACM TOPLAS in 1996 [26]...

متن کامل

Delay in the WAM and the TOAM: redoing a ten year old experiment

A 10 year old experiment related to freeze/2 and its implementation in B-Prolog and SICStus Prolog is redone. B-Prolog uses the TOAM abstract machine and its implementation of delayed goals is by means of suspension frames on the execution stack. The traditional WAM approach partly established by SICStus Prolog implementors is to put suspension terms on the heap. Earlier experiments comparing t...

متن کامل

"Logal": Algorithmic Control Structures for Prolog

II A GENERALIZED LOOP CONSTRUCT In p rac t i ca l Prolog app l i ca t i ons , d i f f i c u l t and opaque uses of control p r im i t i ves are of ten unavoidable. To re l ieve these d i f f i c u l t i e s , a prel iminary set of h ighleve l contro l predicates has been developed. Two technical goals were achieved. The f i r s t was to cast contro l f a c i l i t i e s found desirable in conve...

متن کامل

Automated theorem proving for elementary geometry

Thesis: Automated theorem proving for elementary geometry. This study analyses automated proofs of theorems from Euclidean Elements , book VI, using the area method. The theorems we will be discussing concern Euclidean field theory about equality of non-congruent figures and similarity of the figures [1]. The proofs are generated by the program WinGCLC. My proposed hypothesizes: 1. The way of m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1983